Two Constructions of Multireceiver Authentication Codes from Singular Symplectic Geometry over Finite Fields

New Construction of Authentication Codes with Arbitration from Pseudo-Symplectic Geometry over Finite Fields

A new construction of authentication codes with arbitration from pseudo-symplectic geometry over finite fields is given. The parameters and the probabilities of deceptions of the codes are also computed. §

A New Construction of Multi-receiver Authentication Codes from Pseudo-Symplectic Geometry over Finite Fields

Multi-receiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we constructed one multi-receiver authentication codes from pseudo-symplectic geometry over finite fields. The parameters and the probabilities of deceptions of this codes are also computed.

The Construction of A-code from Singular Pseudo-symplectic Geometry over Finite Fields

A construction of A3-code from singular pseudo-symplectic geometry over finite fields is presented. Under the assumption that the encoding rules of the transmitter, the receiver and the arbiter are chosen according to a uniform probability distribution, the parameters and the probabilities of success for different types of deceptions are computed. Key–Words: A3-codes, Singular Pseudo-symplectic...

Some New Constructions of Authentication Codes with Arbitration and Multi-Receiver from Singular Symplectic Geometry

Bounds and Constructions for Multireceiver Authentication Codes

Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we give a formal deenition of multireceiver authentication codes, derive information theoretic and combinatorial lower bounds on their performance and give new eecient constructions for such cod...